Approximating k-median with non-uniform capacities
نویسندگان
چکیده
In this paper we give a constant factor approximation algorithm for the capacitated k-median problem. Our algorithm produces a solution where capacities are exceeded by at most a constant factor, while the number of open facilities is at most k. This problem resisted attempts to apply the plethora of methods designed for the uncapacitated case. Our algorithm is based on adding some new ingredients to the approach using the primal-dual schema and lagrangian relaxations. Previous results on the capacitated k-median problem gave approximations where the number of facilities is exceeded by some constant factor. Relaxing the constraint on the number of facilities seems to render k-median problems much simpler. In some applications it is important not to violate the constraint on the number of facilities, whereas relaxing the capacity constraints is a natural thing to do, as the capacities express rough estimates on cluster sizes.
منابع مشابه
Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
In the classical k-median problem the goal is to select a subset of at most k facilities in order to minimize the total cost of opened facilities and established connections between clients and opened facilities. We consider the capacitated version of the problem, where a single facility may only serve a limited number of clients. We construct approximation algorithms slightly violating the cap...
متن کاملAn Improved Algorithm for the Hard Uniform Capacitated k-median Problem
In the k-median problem, given a set of locations, the goal is to select a subset of at most k centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of the k-median problem, in which each selected center can only serve a limited number of locations. Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys,...
متن کاملAn Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem
In the k-median problem, given a set of locations, the goal is to select a subset of at most k centers so as to minimize the total cost of connecting each location to its nearest center. We study the uniform hard capacitated version of the k-median problem, in which each selected center can only serve a limited number of locations. Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys,...
متن کاملRounding for k - Centers with Non - uniform Hard
In this paper we consider a generalization of the classical k-center problem with capacities. Our goal is to select k centers in a graph, and assign each node to a nearby center, so that we respect the capacity constraints on centers. The objective is to minimize the maximum distance a node has to travel to get to its assigned center. This problem is NP -hard, even when centers have no capacity...
متن کاملAn approximation algorithm for Uniform Capacitated k-Median problem with 1 + ε capacity violation
We study the Capacitated k-Median problem, for which all the known constant factor approximation algorithms violate either the number of facilities or the capacities. While the standard LP-relaxation can only be used for algorithms violating one of the two by a factor of at least two, Shi Li [SODA’15, SODA’16] gave algorithms violating the number of facilities by a factor of 1 + exploring prope...
متن کامل